Function-described graphs for modelling objects represented by sets of attributed graphs

نویسندگان

  • Francesc Serratosa
  • René Alquézar
  • Alberto Sanfeliu
چکیده

We present in this article the model function-described graph (FDG), which is a type of compact representation of a set of attributed graphs (AGs) that borrow from random graphs the capability of probabilistic modelling of structural and attribute information. We de4ne the FDGs, their features and two distance measures between AGs (unclassi4ed patterns) and FDGs (models or classes) and we also explain an e6cient matching algorithm. Two applications of FDGs are presented: in the former, FDGs are used for modelling and matching 3D-objects described by multiple views, whereas in the latter, they are used for representing and recognising human faces, described also by several views. ? 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modelling and Recognising 3D-Objects Described by Multiple Views Using Function-Described Graphs

In this paper we study the application of FunctionDescribed Graphs (FDGs) for 3D-object modeling and recognition. From a set of topological different 2D-views taken of an object, FDGs are synthesized from the attributed adjacency graphs that are extracted for each view. It is shown that, by keeping in the object representation (an FDG) a qualitative information of the 2-order joint probabilitie...

متن کامل

Learning and recognising 3D models represented by multiple views by means of methods based on random graphs

The aim of this yticle is to describe and compare the methods based on random graphs (RGs) which are applied to learn and recognize 3D objects represented by multiple views. These methods me based on modelling the objects by means of probabilistic structures that keep 1'' and Zndorder probabilities. That is, multiple views of a 3D object are represented by few RGs. The most important probabilis...

متن کامل

A graph distance metric combining maximum common subgraph and minimum common supergraph

The relationship between two important problems in pattern recognition using attributed relational graphs, the maximum common subgraph and the minimum common supergraph of two graphs, is established by means of simple constructions, which allow to obtain the maximum common subgraph from the minimum common supergraph, and vice versa. On this basis, a new graph distance metric is proposed for mea...

متن کامل

CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

متن کامل

Shape Learning with Function-Described Graphs

A new method for shape learning is presented in this paper. This method incorporates abilities from both statistical and structural pattern recognition approaches to shape analysis. It borrows from statistical pattern recognition the capability of modelling sets of point coordinates, and from structural pattern recognition the ability of dealing with highly irregular patterns, such as those gen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Pattern Recognition

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2003